Some Results on (1,2n – 1)-Odd Factors
نویسندگان
چکیده
Let be a graph. If there exists a spanning subgraph G F such that 1,3, , 2 1 F d x n , then F is called to be -odd factor of . Some sufficient and necessary conditions are given for to have n 1,2 1 G G U – 1,2 1 n -odd factor where is any subset of such that U V G U k .
منابع مشابه
Breaking Symmetry on Complete Bipartite Graphs of Odd Size
Players A and B alternatively colour edges of a graph G, red and blue respectively. Let Lsym(G) be the largest number of moves during which B can keep the red and blue subgraphs isomorphic, no matter how A plays. This function was introduced by Harary, Slany and Verbitsky who in particular showed that for complete bipartite graphs we have Lsym(Km,n) = mn 2 if mn is even and that Lsym(K2m+1,2n+1...
متن کاملFurther results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملSign detection algorithm using carry look ahead adder for the RNS Module Set 2n+1,2n-1,2n
The Residue Number System (RNS) is a non-weighted system that is very efficient in digital signal processing and communicational applications. The previous proposed methods for the residue to binary (R/B) conversions are based on the Chinese Reminder Theorem (CRT) or Mixed Radix Conversion (MRC). These theorems are difficult to implement. In this paper, we present a new highspeed ROM-less resid...
متن کاملElementary graphs with respect to (1, f)-odd factors
This note concerns the (1, f)-odd subgraph problem, i.e. we are given an undirected graph G and an odd value function f : V (G) → N, and our goal is to find a spanning subgraph F of G with degF ≤ f minimizing the number of even degree vertices. First we prove a Gallai–Edmonds type structure theorem and some other known results on the (1, f)-odd subgraph problem, using an easy reduction to the m...
متن کاملReverse Convertor Design for the 4-Moduli Set {2n −1,2n,2n +1,22n+1−1} Based on the Mixed-Radix Conversion
The residue number system (RNS) is an integer system capable of supporting high speed concurrent arithmetic. One of the most important consideration when designing RNS system is reverse conversion. The reverse converter for recently proposed for the four-moduli set {2n −1,2n,2n +1,22n+1 −1} is based on new Chinese remainder theorems II (New CRT-II) [6]. This paper presents an alternative archit...
متن کامل